Steiner t-Designs for Large t
نویسنده
چکیده
One of the most central and long-standing open questions in combinatorial design theory concerns the existence of Steiner t-designs for large values of t. Although in his classical 1987 paper, L. Teirlinck has shown that non-trivial t-designs exist for all values of t, no non-trivial Steiner t-design with t > 5 has been constructed until now. Understandingly, the case t = 6 has received considerable attention. There has been recent progress concerning the existence of highly symmetric Steiner 6-designs: It is shown in [M. Huber, J. Algebr. Comb. 26 (2007), pp. 453–476] that no non-trivial flag-transitive Steiner 6-design can exist. In this paper, we announce that essentially also no block-transitive Steiner 6-design can exist.
منابع مشابه
A census of highly symmetric combinatorial designs
As a consequence of the classification of the finite simple groups, it has been possible in recent years to characterize Steiner t-designs, that is t-(v, k,1) designs, mainly for t = 2, admitting groups of automorphisms with sufficiently strong symmetry properties. However, despite the finite simple group classification, for Steiner t-designs with t > 2 most of these characterizations have rema...
متن کاملA generalisation of t-designs
This paper defines a class of designs which generalise t-designs, resolvable designs, and orthogonal arrays. For the parameters t = 2, k = 3 and λ = 1, the designs in the class consist of Steiner triple systems, Latin squares, and 1-factorisations of complete graphs. For other values of t and k, we obtain t-designs, Kirkman systems, large sets of Steiner triple systems, sets of mutually orthogo...
متن کاملA non-existence result and large sets for Sarvate-Beam designs
It is shown that for 2 ≤ t ≤ n− 3, a strict t-SB(n, n− 1) design does not exist, but for n ≥ 3, a non-strict 2-SB(n, n−1) design exists. The concept of large sets for Steiner triple systems is extended to SB designs and examples of a large sets for SB designs are given.
متن کاملA class of Steiner 4-wise balanced designs derived from Preparata codes
The minimum weight codewords in the Preparata code of length n = 4 m are utilized for the construction of an innnite family of Steiner S(4; f5; 6g; 4 m + 1) designs for any m 2. A t-wise balanced design with parameters t-(v; K;) is a pair (X; B) where X is a set of v points and B is a collection of subsets of X (called blocks) with sizes from the set K, such that every t-subset of X is containe...
متن کاملBlock Transitive Resolutions of t - designs andRoom
By a resolution of t-designs we mean a partition of the trivial design ? X k of all k-subsets of a v-set X into t ? (v 0 ; k;) designs, where v 0 v. A resolution of t-designs with v = v 0 is also called a large set of t-designs. A Room rectangle R, based on ? X k , is a rectangular array whose non-empty entries are k-sets. This array has the further property that taken together the rows form a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008